Singular Higher Order Complete Vector Bases for Finite Methods
نویسندگان
چکیده
منابع مشابه
Finite Element-Based Level Set Methods for Higher Order Flows
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Willmore flow as well as variants and of them with more complicated surface energies. Such problems find various applications, e.g. in materials science (crystal growth, thin film technology), biophysics (membrane shapes),...
متن کاملAdaptive higher-order finite element methods for transient PDE problems based on embedded higher-order implicit Runge-Kutta methods
We present a new class of adaptivity algorithms for time-dependent partial differential equations (PDE) that combines adaptive higher-order finite elements (hp-FEM) in space with arbitrary (embedded, higher-order, implicit) Runge-Kutta methods in time. Weak formulation is only created for the stationary residual of the equation, and the Runge-Kutta method is supplied via its Butcher’s table. Ar...
متن کاملSingular Vector Methods for Fundamental Matrix Computation
The normalized eight-point algorithm is broadly used for the computation of the fundamental matrix between two images given a set of correspondences. However, it performs poorly for low-size datasets due to the way in which the rank-two constraint is imposed on the fundamental matrix. We propose two new algorithms to enforce the rank-two constraint on the fundamental matrix in closed form. The ...
متن کاملHigher order temporal finite element methods through mixed formalisms
The extended framework of Hamilton's principle and the mixed convolved action principle provide new rigorous weak variational formalism for a broad range of initial boundary value problems in mathematical physics and mechanics. In this paper, their potential when adopting temporally higher order approximations is investigated. The classical single-degree-of-freedom dynamical systems are primari...
متن کاملCrystal bases , finite complete rewriting systems , and
This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Antennas and Propagation
سال: 2004
ISSN: 0018-926X
DOI: 10.1109/tap.2004.831292